An acceleration simulation method for power law priority traffic

A method for accelerated simulation for simulated self-similar processes is proposed. This technique simplifies the simulation model and improves the efficiency by using excess packets instead of packet-by-packet source traffic for a FIFO and non-FIFO buffer scheduler. In this research is focusing on developing an equivalent model of the conventional packet buffer that can produce an output analysis (which in this case will be the steady state probability) much faster. This acceleration simulation method is a further development of the Traffic Aggregation technique, which had previously been applied to FIFO buffers only and applies the Generalized Ballot Theorem to calculate the waiting time for the low priority traffic (combined with prior work on traffic aggregation). This hybrid method is shown to provide a significant reduction in the process time, while maintaining queuing behavior in the buffer that is highly accurate when compared to results from a conventional simulatio

Optimal design of measurements on queueing systems

We examine the optimal design of measurements on queues with particular reference to the M/M/1 queue. Using the statistical theory of design of experiments, we calculate numerically the Fisher information matrix for an estimator of the arrival rate and the service rate to find optimal times to measure the queue when the number of measurements are limited for both interfering and non-interfering measurements. We prove that in the non-interfering case, the optimal design is equally spaced. For the interfering case, optimal designs are not necessarily equally spaced. We compute optimal designs for a variety of queuing situations and give results obtained under the $D-$- and $D_s$-optimality criteria

Efficient accelerated simulation technique for packet switched networks : a buffer with two priority inputs

An Enhanced Traffic Aggregation (E_TA) technique for acceleration simulation of packet switched network is proposed. This technique simplifies the simulation model and improves the efficiency by using packet-train or packet rate source traffic with non FIFO scheduler in the buffer. The model employs power law traffic which recently proved to be able to capture both long-range dependence and the burstiness of aggregate broadband network traffic. Our results show that using E_TA with FIFO scheduler simulation times can be reduced by 39%, and using E_TA with non FIFO scheduler by 83 %

Accelerated Simulation Method for Power-law Traffic and Non-FIFO Scheduling

Abstract: The conventional method of simulating networks, i.e. packet-by-packet, always consumes many hours and often days of ‘real ’ time just to simulate a few hours of ‘simulation ’ time. Accelerated simulation techniques reduce the number of events simulated and decrease the time needed for an experiment. In this paper we describe our approach to accelerate simulation of a power-law aggregated ON/OFF traffic through a FIFO queue, and then extend the same idea to a non-FIFO queue. 1

ICMU2006 SSIM: A Multi-Resolution Fluid Traffic Simulator for MANETs

Model abstraction techniques have been widely used to accelerate simulations in the context of homogeneous wired networks, whereas their applications to more complex network systems, such as wireless networks, are rare. This paper investigates how model abstraction techniques are applied to simulations of mobile ad hoc networks (MANETs). We introduced a multi-resolution simulation framework based on a fluid-oriented time-stepped (TS) traffic model. We conducted experiments using SSIM which is a session-level MANET simulator developed i

Video-on-demand QoE Evaluation Across Different Age- Groups and Its Significance for Network Capacity

Quality of Experience (QoE) drives churn in the broadband networks industry, and good QoE plays a large part in the retention of customers. QoE is known to be affected by the Quality of Service (QoS) factors packet loss probability (PLP), delay and delay jitter caused by the network. Earlier results have shown that the relationship between these QoS factors and QoE is non-linear, and may vary from application to application. We use the network emulator Netem as the basis for experimentation, and evaluate how QoE varies as we change the emulated QoS metrics. Focusing on Video On Demand we discovered that the reported QoE may differ widely for users of different age groups, and that the most demanding age group (the youngest) can require an order of magnitude lower PLP to achieve the same QoE than is required by the most widely studied age group of users. We then used a bottleneck TCP model to evaluate the capacity cost of achieving an order of magnitude decrease in PLP, and found it be (almost always) a 3-fold increase in link capacity that was required

Accelerated Simulation Method for Power-law Traffic and Non-FIFO Scheduling

Abstract: The conventional method of simulating networks, i.e. packet-by-packet, always consumes many hours and often days of ‘real ’ time just to simulate a few hours of ‘simulation ’ time. Accelerated simulation techniques reduce the number of events simulated and decrease the time needed for an experiment. In this paper we describe our approach to accelerate simulation of a power-law aggregated ON/OFF traffic through a FIFO queue, and then extend the same idea to a non-FIFO queue. 1

Design of experiments for categorical repeated measurements in packet communication networks

We study the optimal measurement of packet loss and delay in packet networks by treating all measurements as numerical experiments to which we apply the theory of the design of experiments. Specifically we seek to find the optimal times at which to inject survey (probe) packets. Our approach is to model the target node in the packet communication network, an access buffer, as a discrete-time Markov chain. Given that we may only make a limited number of observations, we present a method for optimally designing the observation times for the chain, and derive both exact and continuous optimal designs. Our results show that, for common optimality criteria, measuring at a uniform rate may not be optimal. This has significance for influencing commercial practice as uniform probing is standard. We show how our method may be generalized to Markov systems with larger state space, and describe computational methods to find optimal designs on any system which evolves according to the Markov principle